A Simulation on the Bankruptcy Problem As A Convex Game
نویسنده
چکیده
There are a large number of contributions to the bankruptcy problem (cf. the references in Curiel et al. (1987) and Thomson (2002)). This paper examines this problem from the game-theoretic viewpoint in the context of coalitional game. Suppose that a person dies with property left and the property is valued $P. Furthermore, he (or she) owes to n persons with the total debt, valued $D. When P<D, there remains the problem of how the property should be divided between the creditors. Let di be the value of debt to the creditor, i (i=1,...,n), so that D=Úi=1 n di. One of the ways to divide and distribute $P to the creditors is the Proportional Division principle: PD principle. According to the PD principle, each creditor, i, receives Pdi/D (i=1,...,n). The origin of PD principle dates back to Nicomachean Ethics by the Greek philosopher, Aristotle. This principle is not the only distribution principle. The Contested Garment principle: CG principle, is also known. The example of the distribution of $P to d={d1,...,dn} by CG principle was provided in Mishnah of the Talmud, the collection of Jewish dictum. The extension of this example to the general principle was attempted by Aumann and Maschler [1985], in the context of coalitional game. It is well known that the distribution according to the Shapley values is also possible. The final distribution principle is defined the SV principle. The aim of this paper is to examine the relation among the PD principle, the CG principle and the SV principle, in terms of simulation approach.
منابع مشابه
Obtaining a possible allocation in the bankruptcy model using the Shapley value
Data envelopment analysis (DEA) is an effective tool for supporting decision-makers to assess bankruptcy, uncertainty concepts including intervals, and game theory. The bankruptcy problem with the qualitative parameters is an economic problem under uncertainty. Accordingly, we combine the concepts of the DEA game theory and uncertain models as interval linear programming (ILP), which can be app...
متن کاملA bankruptcy problem and an information trading problem: Applications tok-convex games
The paper is devoted to two real problems that generate a cooperative game model with a so-called k-convex characteristic function when certain conditions are fulfilled. Both a bankruptcy problem and an information trading problem are modelled as a cooperative game by constructing the corresponding bankruptcy game as well as the information market game. Firstly, it is established that the bankr...
متن کاملSupervisory Control of a Hybrid AC/DC Micro-Grid with Load Shedding Based on the Bankruptcy Problem
In this paper, a supervisory controller is proposed to manage the power flow in a hybrid AC/DC micro-grid for both grid-connected and disconnected modes. When the hybrid AC/DC micro-grid is connected to the utility grid, power surplus or shortage leads to power trade between the micro-grid and the utility grid. In the grid-disconnected mode, the renewable power sources (wind and solar generatio...
متن کاملA New Method in Bankruptcy Assessment Using DEA Game Theory
One of the most important economic concepts is evaluation and bankruptcy prediction. Financial events, which an organization could be, exposed to serious risks and it goes bankruptcy. Therefore, prediction and assessment bankruptcy enable organizations that to be familiar the financial risks and resolve their financial deficiencies. So in this paper, we discuss one of the most important economi...
متن کاملBankruptcy Assessment with the Interval Programming and Games Theory
Some of the parameters in issues of the reality world are uncertainty. One of the uncertain problems with the qualitative parameters is economic problems such as bankruptcy problem. In this case, there is a probability of dealing with imprecise concepts including the intervals regarding the official’s viewpoint, organizations’ managers. Accordingly, this article uses the concepts of data envelo...
متن کاملModified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کامل